A 2()n algorithm for k-cycle in minor-closed graph families
نویسندگان
چکیده
منابع مشابه
Densities of Minor-Closed Graph Families
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities. This set of numbers is countable, well-ordered, and closed; its order type is at least ωω. It is the closure of the set of densities of density-minimal graphs...
متن کاملProper minor-closed families are small
We prove that for every proper minor-closed class I of graphs there exists a constant c such that for every integer n the class I includes at most n!c graphs with vertex-set {1, 2, . . . , n}. This answers a question of Welsh.
متن کاملPacking minor closed families of graphs
Motivated by a conjecture of Gyárfás, recently Böttcher, Hladký, Piguet, and Taraz showed that every collection T1, . . . , Tn of trees on n vertices with ∑n i=1 e(Ti) ≤ ( n 2 ) and with bounded maximum degree, can be packed into the complete graph on (1 + o(1))n vertices. We generalize this result where we relax the restriction of packing families of trees to families of graphs of any given no...
متن کاملDistributed algorithms for weighted problems in minor-closed families
We give efficient distributed algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we argue that no efficient distributed algorithm for the minimum weight connected dominating set exists.
متن کاملDistributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we indicate that no efficient distributed algorithm for the minimum weight connected dominating set exists.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.07.034